| |
| description |
We present a comparative delay analysis of tree-based reliable
multicast protocols and show the influence of varying sending rates,
group sizes, packet loss probabilities and branching factors of the
control tree. Besides the average delivery delay we consider the
delay to reliably deliver all packets and the round trip delay. The
former two examines the delay between generation of a packet at the
sender and correct reception at a randomly chosen receiver or all
receivers, respectively. The latter is the delay between generation
of a packet at the sender and reception of all acknowledgement
packets at the sender. Our numerical results show that all
tree-based protocols provide low delays and good scalability. From
the four considered protocol classes, NAK-based protocols achieve
the best scalability but ACK-based protocols achieve the lowest
delays.
|
| publisher |
Scottsdale, Arizona, USA: IEEE Press
|
| type |
Text
|
| Article in Proceedings
|
| source |
In: IEEE (ed.): Proceedings of the International Conference on
Computer Communications and Networks (ICCCN 01), pp. 274-281
|
| ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/INPROC-2001-45/INPROC-2001-45.ps
|
| contributor |
Verteilte Systeme (IPVR)
|
| format |
application/postscript
|
| 2623435 Bytes
|
| subject |
Computer-Communication Networks (CR C.2)
|